Glivenko Type Theorems for Intuitionistic Modal Logics
نویسنده
چکیده
In this article we deal with Glivenko type theorems for intuitionistic modal logics over Prior’s MIPC. We examine the problems which appear in proving Glivenko type theorems when passing from the intuitionistic propositional logic Int to MIPC. As a result we obtain two different versions of Glivenko’s theorem for logics over MIPC. Since MIPC can be thought of as a one-variable fragment of the intuitionistic predicate logic Q-Int, one of the versions of Glivenko’s theorem for logics over MIPC is closely related to that for intermediate predicate logics obtained by Umezawa [27] and Gabbay [15]. Another one is rather surprising.
منابع مشابه
A short proof of Glivenko theorems for intermediate predicate logics
We give a simple proof-theoretic argument showing that Glivenko’s theorem for propositional logic and its version for predicate logic follow as an easy consequence of the deduction theorem, which also proves some Glivenko type theorems relating intermediate predicate logics between intuitionistic and classical logic. We consider two schemata, the double negation shift (DNS) and the one consisti...
متن کاملA uniform tableau method for intuitionistic modal logics I
We present tableau systems and sequent calculi for the intuitionistic analogues and IS5 of the normal classical modal logics. We provide soundness and completeness theorems with respect to the models of intuitionistic logic enriched by a modal accessibility relation, as proposed by G. We also investigate the relationship of these logics with some other intuitionistic modal logics proposed in th...
متن کاملGlivenko theorems for substructural logics over FL
It is well known that classical propositional logic can be interpreted in intuitionistic propositional logic. In particular Glivenko’s theorem states that a formula is provable in the former iff its double negation is provable in the latter. We extend Glivenko’s theorem and show that for every involutive substructural logic there exists a minimum substructural logic that contains the first via ...
متن کاملRealization Theorems for Justification Logics: Full Modularity
Justification logics were introduced by Artemov in 1995 to provide intuitionistic logic with a classical provability semantics, a problem originally posed by Gödel. Justification logics are refinements of modal logics and formally connected to them by so-called realization theorems. A constructive proof of a realization theorem typically relies on a cut-free sequent-style proof system for the c...
متن کاملOn the relation between intuitionistic and classical modal logics
Intuitionistic propositional logic Int and its extensions, known as intermediate or superintuitionistic logics, in many respects can be regarded just as fragments of classical modal logics containing S4. At the syntactical level, the Godel translation t embeds every intermediate logic L = Int+ into modal logics in the interval L = [ L = S4 t( ); L = Grz t( )]. Semantically this is re ected by ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Studia Logica
دوره 67 شماره
صفحات -
تاریخ انتشار 2001